Process for the production of an electrical wiring diagram

ABSTRACT

This process allows for the automatic production of an electrical wiring diagram on which are located boxes, each representing a component used in an electrical device, connecting lines, each representing an interconnecting cable and connecting terminals corresponding to a possible connection point between a connecting line and a box, the boxes being arranged along an axis of abscissas and an axis of ordinates. The process includes the following steps: input of the components and cables to be represented on the wiring diagram, each component being of a predetermined type; generation and resolution of a first system of equations to optimize the relative positioning of the boxes on the axis of abscissas and their orientation; generation and resolution of a second system of equations to optimize the relative placement of the boxes and of the terminals in terms of the axis of ordinates; generation and resolution of a third system of equations to place the boxes and the cables in an absolute manner, and production of the wiring diagram corresponding to the numerical data obtained by the resolution of the systems of equations.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to French Application No. 04 00168 Filed Jan. 9, 2004, the entire content of which is hereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The current invention concerns a procedure for the production of a wiring diagram.

The current invention is more specifically intended for the field of aeronautics. However, it can find applications in other sectors, whether it be in the field of transport (automotive, space, etc.) or in other industrial fields (production of industrial machines, computerized home electronic systems, etc.). More specifically, it concerns electrical cabling, but it also applies to the fields of hydraulics, pneumatics, etc. . . .

2. Discussion of the Background

In a modern aircraft, the electrical circuits utilize a significant number of components and are relatively complex. In order to represent them, so that they may first of all be manufactured, then subsequently attended to during service maintenance of the aircraft, basic plans are produced on the one hand, and wiring diagrams, on the other.

An aircraft is composed of different electrical systems (engines, electrical generation, flight controls, braking system, etc.). Each one of these systems is segmented into different chapters, also called functions pursuant to the ATA100 standard (Air Transport Association). The basic plans schematically describe the electrical interconnections between the different elements which compose one function within the system. They allow for a good comprehension of the function described and facilitate troubleshooting during failures. The diagrams (or plans) for the wiring layout, also referred to as WD in abbreviated form which stands for Wiring Diagram (that is to say, the diagram for the wiring layout in English) are designed based on the information contained in the basic plans and they integrate all of the information required for manufacturing the corresponding function in the system. A wiring diagram also makes it possible to provide the department in charge of producing the electrical system with a list of the cables.

Currently, the basic plans as well as the wiring diagrams are produced by hand. Of course, CAD software applications (computer aided design) are used to produce these plans and diagrams. The design of the drawing in and of itself however, remains the responsibility of the draftsman who must position the components and produce routing for the cables which connect said components.

SUMMARY OF THE INVENTION

The objective of the current invention is to replace the manual production of the wiring diagrams that are produced over the course of the service life of an aircraft (or of any other industrial “machine”) with automatically generated diagrams. Numerous graphic design rules must be complied with. The automatic production of the wiring diagrams is rendered very complex by virtue of the number of graphic design rules. Among the existing constraints, one can cite, for example, the fact that a cable represented on a diagram must not traverse a component that is represented on said diagram. Cables are not permitted to be superimposed. They must be represented solely by horizontal or vertical segments. A sufficient amount of space must be maintained between two neighboring “objects” (cables or components). Other constraints that are less stringent must equally be observed by preference. Thus, for example, the various components represented must preferably be vertically aligned. Furthermore, the number of crossings between cables as well as the number of bends produced by said cables must be kept to a minimum. These constraints are provided here as examples and the list is not intended to be exhaustive.

In order to allow for the production of automatically generated wiring diagrams, the current invention proposes a procedure for the production of a wiring diagram on which boxes are located, each representing a component (or a part of a component) that is used in a device subject to cabling, on which conducting lines are located, each representing a connection between two components, and on which terminals are located, corresponding to a possible point of connection between a conducting line and a box, said boxes being arranged along an axis of abscissas and an axis of ordinates.

In accordance with the invention, this procedure is comprised of the following steps:

-   -   input of the components to be represented on said wiring         diagram, each component being of a predetermined type to which         correspond certain constraints that were previously translated         in the form of linear equations,     -   input of connections to be represented on said wiring diagram,     -   generation of a first system of equations and resolution of said         system to optimize the relative positioning of the boxes on the         axis of abscissas in terms of predetermined abscissas as well as         to optimize the orientation of said boxes,     -   generation of a second system of equations and resolution of         said system to optimize the relative placement of the boxes in         terms of the axis of abscissas as well as the relative         positioning of the terminals for each box in terms of same said         axis, and     -   generation of a third system of equations and resolution of said         system so as to place the boxes in an absolute manner in terms         of the axes of the abscissas and of the ordinates, and also to         optimize the routing of the connections.

To be understood under the term “input” further above, is any manner, whether manual or automatic, which allows the introduction of data into an information system such as, for example, data acquired from or output by a data base.

A break down of the complex problem subject to being resolved is what allows us to solve this problem here so as to be able to produce a wiring diagram. The manner of segmenting this problem also allows us, for each step, to understand the wiring diagram in its totality each time.

In the diagram to be produced, the connections to be represented are designated, for example, as cables and they are comprised of one or several wires. A sheath is possibly associated to a cable comprised of several wires. During the relative positioning of the boxes on the axis of abscissas, the cable sheaths are advantageously relatively positioned in terms of the boxes to which they are connected. The cable sheaths are treated here a little differently from the other components, since they constitute components of a specific type. In fact, the sheaths differ from the other components represented specifically by the fact that they constitute components which can be traversed by wires and/or by cables and that they can exhibit connection points intended for the graphic representation of eventual checkpoints for shielding.

In the process described above, the step comprising the generation of a third system of equations is advantageously implemented by the two following substeps:

-   -   Generation of a third system of equations and resolution of said         system so as to place the boxes in an absolute manner in terms         of the axis of ordinates, and     -   Generation of a fourth system of equations and resolution of         said system so as to place the boxes in an absolute manner in         terms of the axis of abscissas and to optimize the routing of         the connections.

In a procedure in accordance with the invention, the optimization of the routing for the connections advantageously provides for the verification of the presence of a locating place on the connections intended for placing a text. In fact, most wiring diagrams provide that the connections (cables or wires) be registered by one or several texts. After having carried out the verification of the presence of a locating site for positioning text, the positioning of said text on the connections is determined, for example, by resolution of a system of equations.

In order to be able to also resolve non-linear problems by a procedure in accordance with the invention, it is proposed, for example, that the linear equations posited here solely make use of whole numbers.

In an original manner, it is hereby provided that a box be defined by its size, its terminals and that it possibly bear a graphic symbol and/or a text and/or a cable symbol associated to one or several terminals.

As indicated further above, the boxes used are of different types. The type of box determines, for example among other things, whether the width of the box is variable, whether its height is variable, whether the sequential arrangement of its terminals is modifiable, whether the box is equipped with outlets, . . .

For the first system of equations mentioned further above, we advantageously assume that the different boxes to be represented are arranged on a predetermined number of vertical lines, and we provide that said first system of equations is comprised of equations translating the constraints relating to the height placement of the boxes on said vertical lines.

The first system of equations can also be comprised of equations that evaluate the number of bends produced in the conducting lines linking the boxes and comprised of other equations to minimize the latter number in the resolution provided in the corresponding step.

The second system of equations called to mind further above is in and of itself comprised, for example, of equations that translate the constraints associated to the grouping of the connecting terminals within the different boxes. One can also provide that this second system of equations is comprised of equations that evaluate the number of intersections produced between the conducting lines linking the boxes and that this number shall tend to be reduced in the corresponding step.

As to the absolute placement of the boxes along the axis of the ordinates, the connecting terminals of the boxes are advantageously arranged at altitudes which are all multiples of a predetermined grid pitch. For this same placement, one can equally establish equations that evaluate the number of disconnects in the linking lines and minimize this number of disconnects.

As to the absolute placement of the boxes along the axis of abscissas, the number of overlaps in the linking lines in the horizontal direction and in the vertical direction is advantageously evaluated and then subsequently reduced. In this instance, one can also, for example, evaluate and minimize the number of intersections in the linking lines.

In a procedure, in accordance with the invention, to establish the equations for the various equation systems, one advantageously defines real variables, for example, variables corresponding to a localization, a dimension etc. on the one hand, and defines binary variables assuming either a value of 0, or a value of 1, for example, to indicate that an element belongs to a set, or to indicate the relative positioning of two elements, etc. on the other hand, and after this and with the aid of said variables, the equations are the translation of constraints proper to the type of wiring diagram to be produced.

So as to obtain a wiring diagram on a monitor screen or on any other means of visualization, or even yet on a paper medium or on such similar medium, after the implementation of a procedure such as the one described further above, one provides that such a procedure is furthermore comprised of the following steps, after the steps of resolution of the various equation systems:

-   -   introduction of the solutions resulting from said resolutions in         a translator that allows for the production of a diagram based         on the numerical data, and     -   production of a diagram corresponding to the numerical data         obtained by the resolution of the equation systems.

The invention also targets an information system and a compiler comprising the means adapted to execute a procedure such as the one briefly described above.

The invention also targets a readable data medium by way of an information system, possibly totally or partially interchangeable, more specifically a CD-ROM or a magnetic recording medium, such as a hard disc or a floppy disc, or a transmitting medium, such as an electrical or optical signal, and comprised of instructions from a computer program allowing for the implementation of a procedure such as the one briefly described above, when said program is loaded with and executed by an information system.

The invention also targets a computer program stored on an information storage medium, and comprising instructions that allow for the implementation of a procedure such as the one briefly described above, when said program is loaded with and executed by an information system.

BRIEF DESCRIPTION OF THE DRAWINGS

The details and advantages of the current invention shall better stand out as a result of the description that follows, which is made in reference to the appended schematic drawing on which:

FIG. 1 represents an example of a wiring diagram to be produced by a procedure in accordance with the invention;

FIG. 2 schematically indicates the graphic composition of a wiring diagram;

FIG. 3 is a table schematically representing imperative constraints during the production of a wiring diagram;

FIG. 4 is a table schematically representing the constraints for optimization during the production of a wiring diagram;

FIG. 5 schematically illustrates the graphic composition of a box appearing in a wiring diagram;

FIG. 6 schematically illustrates the graphic composition of a terminal associated to a box;

FIGS. 7 through 9 schematically illustrate three types of components that may be represented on a wiring diagram;

FIG. 10 schematically represents a procedure flow diagram for the production of a wiring diagram in accordance with the invention; and

FIG. 11 represents an information system comprised of the means adapted to the implementation of the procedure that is schematically illustrated in FIG. 10.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 represents an example of the wiring diagram that can be produced with the aid of a procedure in accordance with the invention. Such a wiring diagram represents all or a part of a device allowing for the production of an electric function. In the case of FIG. 1, one shall note the presence of a neutral zone 2, which permits the establishment of a link to another wiring diagram (not represented in the drawing).

One shall also note, on the wiring diagram from FIG. 1, the presence of boxes 4 with a more or less rectangular shape. There are numerous formats for box 4 types. These boxes are interconnected by the aid of links (or connecting lines) 6 symbolizing the cables. These connecting links 6 connect to the boxes 4 at the level of the terminals. The latter are arranged either directly on a box 4, or at the level of an outlet 8 integral with the box 4. A same box 4 can simultaneously present with terminals for a direct junction to a connecting line 6 and with one (or several) outlet/s 8 equipped with at least one terminal. Some boxes 4 simply present in the form of a rectangle equipped with outlets and/or terminals. Beyond this, other boxes 4 are additionally comprised of a graphic representation that allows for the identification of the component represented by the box. One shall also note that associated to each box 4 and to each line 6, there is a text formed of alphanumerical characters allowing for the identification of the box or of the corresponding conducting line.

FIG. 2 recapitulates the various elements that constitute a wiring diagram. Within said FIG. 2 is located the sheet 10 on which the wiring diagram is produced. This sheet bears the English equivalent of “sheet”. For this sheet 10, it is important that one know its format in particular (for example, A3 or A4) as well as what is illustrated on said sheet. On the lower portion of FIG. 2, the various elements that compose the sheet 10 have been represented. First of all, there is a drawing zone that is described further above and on which appear, more specifically, the boxes 4 and the lines 6. A line 6 more specifically represents a cable (or a wire) as indicated further above, but in certain cases the line in question can be considered as a cross reference 12 as can be seen from FIG. 1.

One also generally finds a cartouche on the sheet 10 (not represented in the drawing) which most often presents itself in the form of a rectangle. Said cartouche is usually arranged to the right of the sheet and/or beneath the drawing zone. It receives the inscriptions that are required and sufficient for the identification and utilization of the document. Such a cartouche most often also contains the name of the company producing the corresponding wiring diagram as well as the name of the person who produced said diagram. Other indications (title, date, identification number, etc. . . . ) can also appear in the cartouche. In addition to this cartouche, it is also possible to provide notes 14 as can be seen more specifically in FIG. 1. The latter provide general indications on the components represented in the drawing zone.

As is known to the person skilled in the art, drawing rules must be observed for the production of a wiring diagram. The table in FIG. 3 reiterates some of these rules for the sake of illustration. The left hand column in this table illustrates graphic representations that are correct as opposed to the right hand column which illustrates graphic representations that are incorrect. The table in FIG. 3 thus reminds us that a line 6 may not intersect a box 4. Two distinct lines may not be superimposed either. These lines must be represented by horizontal or vertical segments. It is also appropriate to allow for a sufficient amount of spacing (generally, 5 mm) between the various objects that appear in the drawing zone (boxes and lines). Finally, the table in FIG. 3 illustrates that a line may not go around a component.

The table in FIG. 4, in and of itself, illustrates the constraints for optimization which should be implemented to the extent possible. The left hand column in this table illustrates graphic representations that are preferred as opposed to the right hand column which illustrates graphic representations that are to be avoided to the extent possible. Thus, it is preferable to align the boxes vertically, to minimize the number of crossings between lines as well as the number of bends formed by said lines and also to harmonize the routing of the lines.

FIG. 5 schematically illustrates the graphic composition of a box appearing on a wiring diagram. Said box is arranged on an x abscissa and on a y ordinate in the wiring diagram. It is rectangular in shape and presents with a width w (in the direction of the axis of abscissas) and with a height h (in the direction of the axis of ordinates). In addition to its rectangular contour, a box 4 can possibly bear a graphic symbol and/or a text and/or a symbol for the type of cable to be connected to said box.

FIG. 6 shows the graphic composition of a terminal. Here, a terminal is considered as a connection point or as a ground connector or even as a dead end (that is to say, the end of a cable that is not connected and capped with a shield).

For the implementation of a procedure in accordance with the invention, it is appropriate to preliminarily analyze the different types of boxes to be represented. One shall note in fact, depending on whether a box 4 represents one such component or another such component, that different constraints shall be made to apply for the box to be represented. Thus, as an example, the box can have given dimensions that are set or it can have variable dimensions. For certain components, it is possible to represent the corresponding terminals in a given sequential order or else, in any order.

Thus, after analyzing all of the components that can be represented on the wiring diagram, it is appropriate to regroup the components by their type and in function of the constraints to be observed when one starts drawing the box representative of said component on the wiring diagram.

FIGS. 7 through 9 represent different types of components. In FIG. 7, a component has been represented designated as “END”. Such a component is comprised exclusively of a text and of a graphic symbol. Such a component can be found, for example, at the end of a line.

In FIG. 8, a type of component is described which has been arbitrarily named “equipment”. As indicated in this figure, a box representing a component of the “equipment” type comprises 1 to n outlets and between 0 to n terminals. Each outlet comprises 1 to n outlets and the sequential order of said terminals in the outlet is open to choice. As to the component of the “equipment” type, its size may vary in terms of its height as well as its width. It is possible to segment the outlet of the component into two “sub-outlets”. It is possible to orient the outlet of said “equipment”. However, the latter is not fragmentable. It can be present in a neutral zone 2 of a wiring diagram. The sequential order of the terminals in this component is open to choice.

In FIG. 9, several types of components are defined. Thus, we first have components of the “diode, resistor” type. Such a component is comprised of two terminals and the sequential order of the terminals is set. Then we have a component of the “VD, VR” type. Such a component comprises 1 to n components of the “diode, resistor” type. In said components of the “VD, VR” type, it is appropriate to maintain the same orientation within one block, the sequential order of the blocks is open to choice and the terminals are positively connected two by two. In a component of the “VS” type, we again find 1 to n terminals. The sequential order of the terminals is open to choice and the connections are produced on both sides of the component. Finally, said FIG. 9 defines a component of the “module” type which is comprised either of a component of the “VD, VR” type, or of a component of the “VS” type. Such a “module” is constant in its width, it presents with a height that is variable, it can be fragmented and it is never located in a neutral zone (the section common to two adjacent sheets).

Of course, it is preferable to have the most possibly restrained number of component types. In function of the application (aeronautical, automotive, computerized home electronic systems, etc. . . ), the number of component types shall be more or less great. This definition for the types is finalized once and for all prior to the implementation of the procedure in accordance with the invention.

Prior to then producing a diagram, it is appropriate to indicate the different components that must be represented on said diagram as well as the manner in which the components are linked. This plurality of information can, for example, be acquired from the basic plan corresponding to the diagram which is to be produced or else retrieved from a data base.

The procedure in accordance with the invention then provides to formulate equations for the data corresponding to the information supplied concerning the boxes to be represented and the conducting lines between said boxes. One could project producing a system of equations that reiterates all of the constraints associated to the production of the wiring diagram. One would then obtain a system of equations so great in size that no computer could actually resolve the equations, even though just ten or so boxes would have to be represented at the least (which is the case for most wiring diagrams). Therefore, the present invention proposes to break down the problem into several subproblems, keeping in mind all the while to consider the inclusiveness of the wiring diagram each step of the way. In the description that follows, the problem, considered as a whole, is resolved by four successive operations. In certain cases, the third and the fourth operations can be regrouped into a single operation.

The present invention also proposes to use linear programming. Advantageously, in the equations and inequalities then written up, only whole numbers shall be used. By these means, it shall then be possible to resolve non-linear problems. We shall then translate into the form of linear equations, on the one hand, the constraints associated to the rules of drafting as well as on the other hand, the constraints defining the types of boxes to be represented.

In FIG. 10, we have schematically represented the major stages of a procedure for the production of a wiring diagram in accordance with the invention. Based on the data that is to be found in a basic plan, designated in FIG. 10 as P.D. (for Principal Diagram or basic plan in English) and based on the rules R, such as those schematically represented in FIGS. 3 and 4, we shall establish various systems of equations. In a first stage 100, equations are described that translate the constraints for the relative placement of the boxes to be positioned and for the orientation of said boxes. In this first stage, we consider the relative positioning of the boxes 4 on the horizontal axis. A reference 150 is entered in the rectangle corresponding to the first operation to indicate that after the relative placement of the boxes on the horizontal axis, we then separately carry out the relative placement of the cable sheaths on the horizontal axis.

In the second stage bearing the reference number 200, we are then interested in the relative placement of the different components on the vertical lines. This placement more specifically affects the crossings produced between the connecting lines 6. After resolving the equations written over the course of this second stage, we shall then know the relative positioning of the various components in the vertical direction.

The various components being relatively placed in terms of one another, we now turn to the third stage bearing the reference number of 300 for the absolute placement of the different boxes 4 on the vertical lines. To optimize this placement, we shall attempt to limit the number of bends made by the connecting lines that connect the boxes.

The fourth stage, bearing the reference number of 400, then concerns the absolute placement of the various elements in the horizontal direction. Over the course of this stage 400, equations are established and resolved to finalize the routing of the cables and to place the texts that are to be inscribed on the wiring diagram.

In certain cases, it is foreseeable that stages 300 and 400 can be treated as one single stage. This is symbolized in FIG. 10 by the joint boxes symbolizing stages 300 and 400. This procedure in accordance with the invention, after the implementation of stages 100, 200, 300 and 400, allows us to obtain a wiring diagram W.D.

As illustrated in FIG. 10, a stage 500 can also be provided. In question is a stage concerning the placement of the texts on the obtained diagram as well as the insertion of comments or such similar items, such as for example concerning the routing that is used in wiring diagrams for the aeronautical industry. This stage can be integrated in a procedure in accordance with the invention but it can also be carried out as an entirely separate procedure.

FIG. 11 schematically represents a device adapted to the execution of a procedure for the production of wiring diagrams in conformity with the current invention, in a preferred mode of embodiment.

This device can more specifically be comprised of a computer.

In the exemplary embodiment described here, the device for the production of wiring diagrams is comprised of a keyboard, a monitor screen and a printer connected to an input-output port of a processing card.

The processing card is comprised of the following which are interconnected by an address bus and a data bus:

A central processing unit or CPU;

A read and write memory or RAM;

A read only memory or ROM;

A non-volatile memory or DISC and

The input-output port or E/8.

Each of the elements illustrated in FIG. 11 is well known to the person skilled in the art of microprocessors and, more generally, of data processing systems. These common elements are therefore not described here.

The non-volatile memory on DISK is comprised, for example, of a hard disc.

The read only memory, or ROM is adapted to save the operating program of the central processing unit or CPU. More specifically, it is comprised of a “program” register to memorize the instructions of a program which implements a procedure that is in conformity with the invention such as it is described in the preceding in reference to the procedure flow diagram from FIG. 10. The wiring diagrams produced can be visualized on a monitor screen and printed out by the printer of the information system.

In the description that follows and for each operation, examples of equations are indicated that are provided on an exemplary basis and which allow the person skilled in the art to posit the equations corresponding to his problem so as to produce a wiring diagram in a mode that is automatic.

First Operation

The objective of this first operation is to place the boxes and other elements to be represented in relation to one another in the horizontal direction. We are assuming here that the wiring diagram, which is a two dimensional [2D] plan, is comprised of an axis of abscissas (x) that is horizontal and of an axis of ordinates (y) that is vertical. The abscissas increase from the back toward the front of the plan and the ordinates increase from the bottom toward the top of the plan.

During this first operation, we also wish to orient the components. A good orientation of the components allows us to limit the number of bends produced at the level of the connecting lines. For each box, there are at least two possible orientations. As previously indicated further above, the boxes are rectangular in shape. They present with two horizontal sides and with two vertical sides. The terminals of a box are arranged on the vertical sides. The orientation of a box therefore consists in determining the orientation of the terminals for this box: Which terminals are toward the front of the wiring diagram? If the box is comprised of independent terminals, there can be a large number of possible orientations for the terminals.

In order to align the boxes on the vertical lines, one can, for example, provide ten vertical lines on the wiring diagram and place the boxes to be represented as centered on said vertical lines. The first and/or the last and/or none of said vertical lines from the diagram to be represented correspond/s to a neutral zone 2. On the example from FIG. 1, only the last vertical line is in the neutral zone 2. In the neutral zone, only certain types of components are to be found.

Placement Variables

First of all, one can define the placement variables. We then consider a component x. We denote as k the number corresponding to a vertical line and X(x) as the abscissa of the component x. We then define the following variables:

ISX(x, k) = 1, if  the  component  x  is  on  the  abscissa  k, if  not = 0  and ${{SS}\left( {x,k} \right)} = {\sum\limits_{j = 0}^{k}{{ISX}\left( {x,j} \right)}}$

We obviously obtain:

${\forall{\times {\sum\limits_{k}{{ISX}\left( {x,k} \right)}}}} = 1$

as well as

${X(x)} = {\sum\limits_{k}{k.{{ISX}\left( {x,k} \right)}}}$

For a component b located at the beginning of a sheet and for a component e located at the end of a sheet, we also have the following constraints: ∀b∈ Begin ∀x∉ Begin ∀kSS(b,k)≧SS(x,k) ∀e ∈ End ∀x∉ End ∀kSS(x,k)≧SS(e,k)

Begin being the set of components located at the beginning of the sheet and End being the set of components being located at the end of the sheet.

Relative Placement of the Components

We are now considering two components x1 and x2. We then define the delta function for the relative position in the following manner: delta(x1, x2)=0, if X(x1)<X(x2) and delta(x1, x2)=1, if X(x1)>X(x2)

We obtain: ∀k(1−delta(x1, x2))≧ISX(x1,k)+(1−SS(x2,k))−1 ∀k delta(x1,x2)≧ISX(x1, k)+SS(x2, k−1)−1

If x1 and x2 are connected, with x1 distinct from x2, we also have: ∀k ISX(x1, k)+ISX(x2, k)≦1

This last line indicates that two components connected to one another are not located on the same vertical line.

However, we can also provide for making it possible to connect two components to one another that are located on the same vertical line. For the relative placement of the components, we then define the equations as follows: delta(x1, x2)=0, if X(x1)<X(x2) and delta(x1, x2)=1, if X(x1)>X(x2) deq(x1, x2)=0, if X(x1)=X(x2) and deq(x1, x2)=1, if X(x1)≠X(x2)

In this case (vertical connections), we have the following equations: deq(x2, x1)=deq(x1, x2) delta(x1, x2)+delta(x2, x1)=deq(x1, x2) ∀k(1−delta(x1, x2))≧ISK(x1, k)+(1−SS(x2, k−1))−1 ∀k delta (x1, x2)≧ISK(x1, k)+SS(x2, k−1)−1 ∀k deq(x1, x2)≧ISK(x1, k)−ISK(x2, k) ∀k deq(x1, x2)≦ISK(x2, k)−ISK(x1, k) ∀k deq(x1, x2)≦2−ISK(x2, k)−ISK(x1, k)

These equations here above, in both cases (vertical connections or not) are only to be generated for one of the pairs (x1, x2) or (x2, x1).

Orientation Variables

We take a terminal b1 of a component x under consideration. We then define the orientation function [orient] in the following manner:

orient(b1)=0, if the cable extends toward the front,

orient(b1)=1, if the cable extends toward the back,

Bends

α) Here, we are considering a connecting line between terminal b1 and terminal b2. In the case where there are no vertical lines, the presence of a bend on the b1 side is given by the following equation: bend(b1, b2; b1)=|orient(b1)−delta(b1, b2)|

The presence of a bend on the b2 side is given by the following equation: bend(b1, b2; b2)=|orient(b2)−delta(b2, b1)|

After this, we determine the position of the bend. Thus, if a connecting line between terminals b1 and b2 presents with a bend on the b1 side, on the vertical line k, we will then have: bend(b1, b2; b1; k)=1, if the bend is on the vertical line k, if not=0.

We therefore have the two following equations for a bend on the b1 side on the vertical line k and for a bend on the b2 side on the vertical line k: ∀k bend(b1, b2; b1; k)=ISX(b1, k).bend(b1, b2; b1) ∀k bend(b1, b2; b2; k)=ISX(b2, k).bend(b1, b2; b2)

Such a function is then implemented with the aid of the following constraints for the b1 side: bend(b1, b2; b1)≧orient(b1)−delta(b1, b2) bend(b1, b2; b1)≧delta(b1, b2)−orient(b1) ∀k bend(b1, b2; b1; k)≧bend(b1, b2; b1)+ISX(b1, k)−1

We carry out a similar implementation for the b2 side.

β) In the case where vertical connections are planned, the presence of a bend on the b1 side, or respectively on the b2 side, is provided by the following equations: bend(b1, b2; b1)=deq(b1, b2)|orient(b1)−delta(b1, b2)| bend(b1, b2; b2)=deq(b1, b2)|orient(b2)−delta(b2, b1)|

The same applies as previously. We have: ∀k bend(b1, b2; b1; k)=ISX(b1, k).bend(b1, b2; b1)

(Bend side b1 on the vertical line k) ∀k bend(b1, b2; b2; k)=ISX(b2, k).bend(b1, b2; b2)

(Bend side b2 on the vertical line k)

This function is implemented with the aid of the following constraints for the b1 side: bend(b1, b2; b1)≧deq(b1, b2)+(orient(b1)−delta(b1, b2))−1 bend(b1, b2; b1)≧deq(b1, b2)−(orient(b1)−delta(b1, b2))−1 ∀k bend(b1, b2; b1; k)≧bend(b1, b2; b1)+ISX(b1, k)−1

We carry out a similar implementation for the b2 side.

A vertical connection with the correct orientations counts for one bend, if not for two. Vertbend(b1, b2)=(1−deq(b1, b2)) (1+|orient(b2)−delta(b2, b1)|)

implemented with the aid of the constraints: Vertbend(b1, b2)≧2(1−deq(b1, b2))+(orient(b2)−delta(b2, b1))−1 Vertbend(b1, b2)≧2(1−deq(b1, b2))−(orient(b2)−delta(b2, b1))−1

The above equations are to be generated only for one of the pairs (x1, x2) or (x2, x1).

Points of Passage

A point of passage on the vertical line k is created for the connection between x1 and x2, if: X(x1)≦k−1 and X(x2)≧k+1 or X(x1)≧k+1 and X(x2)≦k−1

given: Passage(x1, x2; k)=SS(x1, k−1)(1−SS(x2, k))+SS(x2, k−1)(1−SS(x1, k))

implemented in the form of: Passage(x1, x2; k)≧SS(x1, k−1)+(1−SS(x2, k))−1 Passage(x1, x2; k)≧SS(x2, k−1)+(1−SS(x1, k))−1

A point of passage can also be created, if x1 and x2 are on the same vertical line, but with different orientations: Vertpass(x1, x2)=(1−deq(x1, x2))|orient(x1)−orient(x2)| ∀k vertpass(x1, x2; k)=ISX(x1, k) vertpass(x1, x2)

implemented in the form of: vertpass(x1, x2)≧(1−deq(x1, x2))+orient(x1)−orient(x2))−1 vertpass(x1, x2)≧(1−deq(x1, x2))−orient(x1)−orient(x2))−1 ∀k vertpassK(x1, x2; k)≧vertpass(x1, x2)+ISK(x1, k)−1

The above equations are to be generated only for one of the pairs (x1, x2) or (x2, x1).

Size Constraints in Terms of Height

We are interested in the spatial height occupied by the components.

First of all, we take a type 1 component x under consideration. We assume that a component of this type is comprised of outlets. Let p be such an outlet. We designate Pr₀ as the function indicating whether an outlet is present on the right side. The function Nb₀ indicates the number of terminals on the right side. We then have:

Pr₀(x, p)=1, if at least one terminal of the outlet p is on the right side, if not=0.

Nb₀(x, p)=the number of terminals on the right side ∀ terminal b∈p, Pr₀(x, p)≧1−orient(b)

${{Nb}_{0}\left( {x,p} \right)} = {\sum\limits_{b \in p}\left( {1 - {{orient}(b)}} \right)}$

For the left side, we will have:

Pr₁(x, p)=1, if at least one terminal of the outlet p is on the left side, if not=0.

Nb₁(x, p)=the number of terminals on the left side ∀ terminal b∈p, Pr₁(x, p)≧orient(b)

${{Nb}_{1}\left( {x,p} \right)} = {\sum\limits_{b \in p}{{orient}(b)}}$

If one considers that H(x) is the height of the component x, this height is the maximum of the heights on each side of the component x. We therefore have:

${H(x)} \geq {{\sum\limits_{p \in x}\left( {{{Nb}_{0}\left( {x,p} \right)} + {2{\Pr_{0}\left( {x,p} \right)}}} \right)} + {{textheight}(x)}}$ ${H(x)} \geq {{\sum\limits_{p \in x}\left( {{{Nb}_{1}\left( {x,p} \right)} + {2{\Pr_{1}\left( {x,p} \right)}}} \right)} + {{textheight}(x)}}$

If one now considers all of the components, that is to say those of a type different from type 1, and if one wishes to know the height that is taken up by the components on a line k, then we have the following equation:

$E_{k} = {{\sum\limits_{x,{{{type}\mspace{11mu}{(x)}} \neq 1}}{{{ISX}\left( {x,k} \right)}.{{Size}(x)}}} + {\sum\limits_{x,{{{type}\mspace{11mu}{(x)}} = 1}}{H\left( {x,k} \right)}}}$

where E_(k) is the height occupied by all of the components on the vertical line k and size(x) is the height of a component x which is not of type 1.

In the same manner, we define the space occupied by the bends [C] in the following manner:

${C_{k} = {\sum\limits_{{x\; 1}\leftrightarrow{x\; 2}}\left( {{{bend}\left( {{x\; 1},{{x\; 2};{x\; 1};k}} \right)} + {{bend}\left( {{x\; 1},{{x\; 2};{x\; 2};k}} \right)}} \right)}},$

and the space occupied by the points of passage:

$P_{k} = {\sum\limits_{{x\; 1}\leftrightarrow{x\; 2}}{\text{(}{{passage}\left( {{x\; 1},{{x\; 2};k}} \right)}\left( {{no}\mspace{14mu}{vertical}\mspace{14mu}{connections}} \right)}}$ $P_{k} = {\sum\limits_{{x\; 1}\leftrightarrow{x\; 2}}{\left( {{{passage}\left( {{x\; 1},{{x\; 2};k}} \right)} + {{vertpassK}\left( {{x\; 1},{{x\; 2};k}} \right)}} \right)\left( {{if}\mspace{14mu}{not}} \right)}}$

The overall constraint is therefore written up as: ∀K E _(k) +W _(bend) C _(k) +W _(pass) P _(k)≦sheetheight

W_(bend) and W_(pass) are set, for example, at 1.

In function of the types of components that must figure on the diagram, it is possible that additional constraints will appear. These constraints shall be transcribed in the form of linear equations that will have to be added to the types of equations defined above.

In this first operation, it is also provided that the relative sequential order of the components shall be optimized in the horizontal direction, for example, by limiting the number of bends and points of passage. We therefore propose as an additional constraint, in the case where there are no vertical connections, to optimize the following function:

${C_{1}{\sum\limits_{e\leftrightarrow e^{\prime}}{\sum\limits_{k}\left( {{{bend}\left( {e,{e^{\prime};e;k}} \right)} + {{bend}\left( {e,{e^{\prime};e^{\prime};k}} \right)}} \right)}}} + {C_{2}{\sum\limits_{e\leftrightarrow e^{\prime}}{\sum\limits_{k}{{Passage}\left( {e,{e^{\prime};k}} \right)}}}}$

with, for example, C₁=20 and C₂=1.

With vertical connections, we minimize, for example, the following function:

${C_{1}{\sum\limits_{e\leftrightarrow e^{\prime}}{\sum\limits_{k}\left( {{{bend}\left( {e,{e^{\prime};e;k}} \right)} + {{bend}\left( {e,{e^{\prime};e^{\prime};k}} \right)} + {{vertbend}\left( {e,e^{\prime}} \right)}} \right)}}} + {C_{2}{\sum\limits_{e\leftrightarrow e^{\prime}}{\sum\limits_{k}{{passage}\left( {e,{e^{\prime};k}} \right)}}}}$

with, for example, C₁=20 and C₂=1.

The resolution of the system with the above disclosed equations and with the various constraints allow us to determine all of the values for the ISX(x, k) function for each component x and for all of the vertical lines k.

The resolution of this system of equations with the constraints also allows us to know the orientation of the various components x. We can therefore know the values of the orient(b) function for each terminal b of a component x.

Postprocessing Relative to the Sheaths

The object of this postprocessing step is to make the sheaths appear in the proximity of the components to which they are connected. We shall therefore leave the sheaths, or more specifically the boxes representing them, on their vertical lines and rather move them in blocks, while the sheaths shall be made to individually “float” while respecting the constraints of the sequencing process arrangement emerging from the above resolution of the system of equations. Thus, the previously effected optimization of the bends remains valid.

The vertical lines 0, . . . , XMAX shall be moved at the level of the X₀, . . . , X_(XMAX) coordinates (whole variables). To keep the sequencing process arrangement, we therefore have the following constraint: ∀i≦1 Xi≧Xi−1+δ_(i−1)

with δ_(i−1) being equal to 1, if the vertical line i−1 has at least one component which is not a sheath, if not=0 (we are not concerned with the vertical lines that contain nothing but sheaths).

Furthermore, between the two main vertical lines, there is either nothing, or there are at least two subvertical lines such that a sheath would appear to be in proximity of a component. We must have (X_(i)−X_(i−1)) being less than or equal to 1, greater than or equal to 3, but not equal to two. We therefore use the binary variables ISB_(i) with the following constraints: X _(i) −X _(i−1)≦1+ISB _(i) .XMAX X _(i) −X _(i−1)≧3−(1−ISB _(i)).XMAX

Each sheath g shall have a new coordinate x_(g) (whole variable). The sheaths must comply with the constraints of arrangement defined for the components x. For all of the upstream components (non-sheaths) to which a sheath is associated and if x₀(g) is the greatest coordinate of these components, we have: x _(g) ≧X _(x0(g))+1

Likewise, for all downstream components (non-sheaths) to which the sheath g is associated, if x₁(g) is the smallest coordinate of the components, we have: x _(g) ≦X _(x1(g))−1

For all of the sheaths g′ to which it is associated upstream: x _(g) ≧x _(g′)+1

and for all of the sheaths downstream: x _(g) ≦x _(g′)−1

The sheaths must not be located on the vertical lines that contain the components either. If x₁(g)−x₀(g)≧2, we must then also have: ∀x x ₀(g)+1≧x≧x ₁(g)−1 x _(g)≧−1+(XMAX+1).d _(g, x) ∀x x ₀(g)+1≦x≦x ₁(g)−1 x _(g)≧1−XMAX(1−d _(g, x))

d_(g, x) being a binary variable equal to 0, if x_(g)<x and equal to 1, if x_(g)>x.

The new variable xmsheet (maximum number of vertical lines within a sheet) shall be recovered with the aid of the following constraint: ∀k xmsheet≧X_((k+1)XMAXSHEET) −X _(k.XMAXSHEET)

where XMAXSHEET is the maximum number of vertical lines per component.

For all of the upstream components (which are not sheaths) to which a sheath (g) is connected by its points of passage, x′₀(g) is the largest coordinate of these components, and the same applies to x′₁(g) for all of the downstream components. We then minimize the function:

${K_{1}{\sum\limits_{g}{\min\left( {x_{g} - {X_{x^{\prime}0{(g)}}.X_{x^{\prime}1{(g)}}} - x_{g}} \right)}}} + {K_{2}.{xmsheet}}$

with, for example K₁=20 and K₂=1.

Second Operation

While the first operation concerns the relative sequential order of the boxes in the horizontal direction, the second operation has the objective of relatively placing the boxes in terms of one another in the vertical direction. This vertical arrangement has an influence on the crossings between the connecting lines 6 linking the boxes 4. This second operation has the objective, on the one hand, of arranging the boxes on each of the vertical lines of the diagram (relative layout), and on the other hand, of arranging the terminals relative to one another, inside of each box. The relative position of the boxes and of the terminals shall be selected in such a manner so as to minimize the number of intersections between the connecting lines 6.

Representation of the Arrangement of Terminals

Let us assume two ordinates x and y on a same vertical line. We define a function d by analogy to the delta function from the first operation. d is defined in the following manner:

d(x,y)=0, if x<y and d(x,y)=1, if x>y

(x and y being whole numbers, the case of x=y being excluded)

We have x−y=(2d(x, y)−1)(1+(M−1)u),

M being the upper terminal of |x−y| and u being a continuous intermediary variable in [0, 1] expressing that (x−y) is in [−M, −1], if d(x, y)=0, or is in [1, M], if d(x, y)=1.

Some constraints are associated to the function d(x, y) which are then the following: x−y−2d(x, y)−2(M−1)v−(M−1)u=−1 v≦d(x, y) (v represents xy) v≦u v≧d(x, y)+u−1 0≦u≦1 0≦d(x, y)≦1 0≦v≦1

Grouping of the Terminals

Here, we consider a component of a given type for which there exists a set B of terminals b, all located on a same column, and all of the terminals from the B set must remain grouped together. To translate this constraint, we can consider that all of the terminals from B are arranged in sequence in the same manner as each one of the terminals not belonging to B. Thus, no terminal not belonging to B can be placed between two terminals belonging to B. We then come up with the following equation: ∀b, b′∈B, ∀(e, q, c), x _(e) =x _(b) , c∉B, d(y _(b) , y _(e, q, c))=d(y _(b′) y _(e, q, c))

here, (e, q, c) represent a terminal.

e corresponds to the component to which the terminal belongs,

q is possibly the outlet on which the terminal is located and

c is the name of this terminal.

Optimization of the Intersections

α) Intersections Between Horizontal Connections:

We consider that all of the orientations are made in an ideal manner (in terms of the direction of the connections). Let us assume (e, p, b), a terminal of abscissa x and (f, q, c) a terminal of abscissa x+1, with (e, p, b)

(f, q, c), the expression:

${D\left( {e,p,{b;f},q,c} \right)} = {\sum\limits_{{{({e^{\prime},p^{\prime},b^{\prime}})}\leftrightarrow{({f^{\prime},q^{\prime},c^{\prime}})}},{x_{e^{\prime}} = x_{e}},{x_{f}^{\prime} = x_{f}}}{{{d\left( {Y_{e,p,b},Y_{e^{\prime},p^{\prime},b^{\prime}}} \right)} - {d\left( {Y_{f,q,c},Y_{f^{\prime},q^{\prime},c^{\prime}}} \right)}}}}$ will count the number of cables that intersect the line (e, p, b)

(f, q, c).

We must minimize:

${NHH} = {\sum\limits_{k}{\sum\limits_{{{({e,p,b})}\leftrightarrow{({f,q,c})}},{x_{e} = x},{x_{f} = {x + 1}}}{D\left( {e,p,{b;f},q,c} \right)}}}$

β) Intersections Between the Vertical Connections:

If on the same vertical line, there are connections between the terminals b₁ and b₂ on the one hand, and between the terminals c₁ and c₂ on the other hand, in order to avoid having the connections intersect, it is required that:

[d(b₁, c₁)+d(b₁, c₂)+d(b₂, c₁)+d(b₂, c₂)] be an even number.

If N is equal to 0 or 4, the connections are completely disjointed.

If N is equal to 2, one is on the inside of another. We therefore write up:

d(b₁, c₁)+d(b₁, c₂)+d(b₂, c₁)+d(b₂, c₂)=2A(b₁, b₂, c₁, c₂)+B(b₁, b₂, c₁, c₂)

with A(b₁, b₂, c₁, c₂) and B(b₁, b₂, c₁, c₂) declared as variables that are whole numbers (A(b₁, b₂, c₁, c₂)≦2 and B(b₁, b₂, c₁, c₂)≦1 and we add B(b₁, b₂, c₁, c₂) to the cost function.

The total number of intersections between the vertical lines is therefore:

${NVV} = {\sum\limits_{x}{\sum\limits_{orient}{\sum\limits_{{b_{1}\leftrightarrow b_{2}},{c_{1}\leftrightarrow c_{2}}}{B\left( {b_{1},b_{2},c_{1},c_{2}} \right)}}}}$

γ) Intersections Between Vertical Connections and Horizontal Connections:

If there is a vertical connection between the terminals b₁ and c₂ and if a horizontal connection starts from the terminal c₁, in order that the connections do not intersect, it is required that d(b₁, c₁)=d(b₂, c₁).

We therefore add |d(b₁, c₁)−d(b₂ c₁)| to the cost function: IVH(b ₁ , b ₂ , c ₁)+d(b ₁ , c ₁)−d(b ₁ , c ₂)≧0 IVH(b ₁ , b ₂ , c ₁)−d(b ₁ , c ₁)+d(b ₁ , c ₂)≧0

The total number of intersections between the vertical and horizontal lines is therefore:

${NVH} = {\sum\limits_{x}{\sum\limits_{orient}{\sum\limits_{{b_{1}\leftrightarrow b_{2}},c_{1}}{{IVH}\left( {b_{1},b_{2},c_{1}} \right)}}}}$

δ) Remote Connections and Bends:

For the so-called “remote” connections (x_(f)−x_(e)≧2), we create intermediary passage points (virtual components) and we refer back to the above case.

For terminals whose orientation is in contradiction with the direction of the connection, it is necessary to create a virtual point of passage for the bend (grouped together with the component) and to replace the terminal with this passage point in the above formula.

In this case, the respective order of the virtual passage points and of their associated terminals must be treated in the same manner as in the case of a connection between two terminals of a same component.

Grouping of Multiple Wire Cables

In the case of a multiple wire cable, it is preferable to group together the set of wires forming the corresponding cable. However, in certain cases, there are infeasibility risks. Of course, it is preferable that all of the terminals b of a set B of terminals remain joined side by side. However, in certain cases, as for example, in the case of multiple wire cables, we can tolerate that a terminal be inserted between two terminals of a same set B. We then speak, for example, of a “weak” grouping.

In such cases, we can then count the number of times when the external terminals come to be inserted inside of the B set, or let us assume P_(blind) this number.

We will have:

$P_{blind} = {\sum\limits_{b,{b^{\prime} \in B}}{\sum\limits_{{c \notin B},{x_{c} = x_{b}}}{{{d\left( {y_{b},y_{c}} \right)} - {d\left( {y_{b^{\prime}},y_{c}} \right)}}}}}$

In the cost function subject to optimization and concerning the number of intersections, this number can come to appear as a penalty.

In function of the different types of components, additional constraints can appear. In function of the types of components defined, these constraints shall be formulated into equations as shown further above.

Cost Function

We minimize C₁NHH+C₂NVV+C₃NVH+C₄P_(blind)

For example C₁=C₂=C₃=C₄=1

Of course, other constraints can be implemented as well in the form of equations. This will naturally depend on the type of components capable of being represented. These various constraints will also be able to appear at the level of the cost function mentioned above.

It is also possible to simplify the system subject to optimization and to divide it into two subsystems.

In the pack of equations described in the paragraph on “representation of the arrangement of terminals”, a pair of terminals (b, b′) shall in fact be arranged by d(e, e′), e and e′ being the differentiating “entities” for b and b′. As a result, there can be several pairs (b, b′) for a same d(e, e′). It is sufficient to take just a single one to have the proper definitions for the d(e, e′). The procedure to be used is therefore the following:

1) Set up a table T_(e, e′)={(b, b′):d(b, b′)≡d(e, e′)} and a table B_(b, b′)={(b, b′): d(d, d′) ≡d(e, e′)}

2) For each (e, e′) in T, generate the pack of equations described in the paragraph on “representation of the arrangement of terminals” for one of the (b, b′) of T_(e, e′) (typically the first), as well as all of the other constraints.

3) Optimize the system obtained in this manner for the cost function. Thus, we have d(e, e′)s that are correct, but altitudes that are “fuzzy”.

4) Reread the d(e, e′) obtained. For each (b, b′) pair, generate the constraint y_(b)≦y_(b′)−1, if d(b, b′) (i.e. d(B_(e, e′))) is equal to 0, or y_(b)≧y_(b′)+1 in the converse case.

5) Minimize the maximum of the y_(b)s: ∀b, ym≧y_(b) and the minimum: ym.

Third Operation

The optimization of the cost functions defined in the first and second operations has allowed us to produce a relative placement for all of the components to be represented on the wiring diagram. This third operation therefore has the objective of producing an absolute placement of the components in the vertical direction while observing the behavioral constraints corresponding to the types of components arranged on a same vertical line.

As for the horizontal placement of the components, we have provided a limited number of vertical lines on which are arranged the components. We therefore provide for placing the terminals at altitudes consisting of whole numbers from the grid pitch. To minimize the number of disconnects at the level of the linking lines, and therefore the number of bends as well, we minimize the number of cases where the terminals connected to one another are not located at the same altitude.

Constraints

For the components, as can be seen in FIG. 1, the corresponding text is placed beneath the component. We designate:

txt_(ek) the altitude of the text to the component e_(k),

top_(ek) the altitude of the peak of the component e_(k), and

low_(ek) the lower altitude of the component e_(k).

We then have the following constraints:

txt_(ek)≧top_(ek−1)+D_(min), D_(min) being the minimal distance separating two components.

low_(ek)=txt_(ek)+textheight(e_(k))

Positing between two terminals:

Δ⁻(b_(j))=min(Δ⁻(b_(j), 0), Δ⁻(b_(j), 1)) and

Δ₊(b_(j))=max(Δ₊(b_(j), 0), Δ₊(b_(j), 1)) and

y_(bj)+Δ⁻(b_(j)) Deltaterminal≦y_(b) _(j−1) +Δ₊(b_(j−1))Deltaterminal [+Delyaoutlet], if the component, or the box it represents, can be drawn out

y_(bj)=y_(b) _(j−1) , +Deltaterminal [+Deltaoutlet], if not.

This depends on the type of component and is set by the behavioral specifications.

The term Deltaoutlet is only present if b_(j−1) is the last terminal of the preceding outlet and b_(j) is the first terminal of the outlet being processed. It is the distance between the outlets. It depends on the type of component.

For the first terminal of the component, we furthermore have:

top_(e)=Y_(b) _(last) +C, C being set by the specifications defining the component in function of its type.

The actual draft (or stretch, or spread) of the component is: DRAFT_(e)=top_(e)−low_(e)−size(e)

The actual height used inside of the sheet s is:

${HEIGHT}_{s} = {\max\limits_{{S.{XMAXSHEET}} \leq k \leq {{({s + 1})}{XMAXSHEET}}}{\underset{{X{(e)}} = K}{\max\;}\mspace{11mu}{top}_{e}}}$

The y_(b) _(i) are variable whole numbers.

If the component cannot be drawn out (or stretched), the first terminal of each outlet is declared to be whole, if not, they all are.

Optimization

The main criterion is the number of disconnects.

For each connection (b, b′) of terminals positioned on two consecutive vertical lines and connected with one another, we define D(b, b′) as a variable binary number by:

Maxheight.D(b, b′)+y_(b)−y_(b′)≧0

Maxheight.D(b, b′)−y_(b)+y_(b′)≧0

D(b, b′) shall therefore be equal to 0, if there is no disconnect, and shall be equal to 1 otherwise.

A secondary criterion added after the fact is the length of the components which must not be drawn out (or stretched or elongated) indefinitely without any requirement.

The cost function is therefore:

${W_{1}{\sum\limits_{b\leftrightarrow b^{\prime}}{D\left( {b,b^{\prime}} \right)}}} + {W_{2}{\sum\limits_{e\mspace{14mu}{draftable}}{DRAFT}_{e}}} + {W_{3}{\sum\limits_{s}{HEIGHT}_{s}}}$

W₁ is set, for example, to be the product of the number of components that are draftable by the number of sheets. W₂ takes on, for example, the value of the number of sheets

and W₃ is equivalent to, for example,

$\frac{1}{Maxheight}.$

Fourth Operation

The objective of this fourth and last operation is to now also produce the absolute placement of the components on the horizontal line. Here, we are more specifically interested in the routing of the cables and in the placement of the texts.

Routing of the Cables

Connections:

Let (y_(i), z_(i)) be the known altitudes of the terminals concerned in a connection C_(i) on the vertical lines t and t+1.

Let (y_(j), z_(j)) be the known altitudes of the terminals concerned in a connection C_(j) on the vertical lines t and t+1.

P_(i) and P_(j) are the abscissas of the passage points that we are seeking to determine.

The connections are sorted out by altitude: y_(i)<y_(j), if i<j.

We examine all of the pairs {C_(i), C_(j)} with i<j.

The basic constraints are written up in the following manner: P _(i) −P _(j) =Z _(ij)(2D _(ij)−1)(1+(M−1)U _(ij))

in which:

D_(ij)=0, if P_(i)<P_(j), D_(ij)=1, if P_(i)>P_(j) and indifferent if P_(i)=P_(j).

Z_(ij)=0, if P_(i)=P_(j),=1 if not.

M is the possible maximum for |P_(i)−P_(j)| for all possible (i, j)s (it is a constant known in advance).

U_(ij) is a continuous intermediary variable in [0, 1] that is used to implement the fact that P_(i)−P_(j) is in [−M, −1], if D_(ij)=0, in [1, M], if D_(ij)=1, or P_(i)=P_(j), if Z_(ij)=0.

The product of Z_(ij)D_(ij) is implemented by: Zd_(ij)≦Z_(ij) ZD_(ij)≦D_(ij) ZD _(ij) ≧Z _(ij) +D _(ij)−1

The same applies to Z_(ij)U_(ij): Zu_(ij)≦Z_(ij) ZU_(ij)≦U_(ij) ZU _(ij) ≦Z _(ij) +U _(ij)−1

The product of Z_(ij)D_(ij)U_(ij) is then implemented by: ZDU_(ij)≦Z_(ij) ZDU_(ij)≦D_(ij) ZDU_(ij)≦U_(ij) ZDU _(ij) ≦Z _(ij) +D _(ij) +U _(ij)−2

The overall constraint is then finally written up as: P _(i) −P _(j) =−Z _(ij)+2ZD _(ij)−(M−1)ZU _(ij)+2(M−1)ZDU _(ij)

If y_(i)=z_(i), there is no need for a point of passage. The connection C_(i) is horizontal.

If [y_(i), z_(i)] does not intersect [y_(j), z_(j)], nothing needs to be done for the pair {C_(i), C_(j)}.

If [y_(i), z_(i)] intersects [y_(j), z_(j)], then we must have Z_(ij)=1. The points of passage must be located at different points, otherwise the vertical lines would be stacked over one another and we would have a vertical overlap.

The same applies when y_(i)=z_(j). There is a horizontal overlap if P_(i)≦P_(j)−1, that is to say D_(ij)=1 and Z_(ij)=1.

Let us assume OV_(ij) the variable indicating whether there is horizontal overlap or not for the connections C_(i) and C_(j). OV _(ij) ≧D _(ij) +Z _(ij)−1.

The same applies when y_(j)=z_(i). There is a horizontal overlap if P_(j)≦P_(i)−1, that is to say D_(ij)=0 and Z_(ij)=1. OV _(ij)≧(1−D _(ij))+Z _(ij)−1.

We also determine a variable INT_(ij) to define the intersections between C_(i) and C_(j).

If the connections C_(i) and C_(j) go in different directions, that is to say, if:

z_(i)>y_(i) and z_(j)<y_(i) or z_(j)<y_(i) and z_(j)>y_(j),

there will be an intersection in any case.

When the two connections C_(i) and C_(j) are rising, such as y_(i)<y_(j), there will be an intersection if D_(ij)=0, or: INT _(ij)=1−D _(ij)

To optimize the routing of the cables, we define a maximum point of passage called P_(max), defined by: ∀I P_(max)>P_(i).

We then minimize the function:

${{K.{\sum\limits_{i < j}\left( {{OV}_{ij} + {INT}_{ij}} \right)}} + P_{\max}},$

K being a constant.

Verification for Possible Placement of Texts on the Cables

We verify, sheet by sheet, whether it is possible to place the texts that we wish to lay out on each sheet.

A first constraint consists therein that the space available to insert text must be greater than the length of the text that we wish to write out. This constraint can be written up in a mathematical form.

Constraints

These are done sheet by sheet. For one sheet:

We then assume that we have a set of texts {T₁ . . . T_(N) _(txt) } and that for each text the possible sequence of placement ranges is: P_(t)={(X_(t,1), X′_(t,1)) . . . (X_(t,nt), X′_(t,nt))}.

Furthermore, each text is composed of m_(t) pieces of text whose length is L_(t,1,) . . . L_(t,mt). The x_(i,j) are relative coordinates represented by whole numbers. In order to obtain an absolute placement, it will be necessary to associate a factor of F_(x) to each interval [x, x+1], possibly with F_(x)=1.

The actual length of the range (X_(t,i), X′_(t,i)), that is to say the space available is then:

$\sum\limits_{X = X_{t,i}}^{X_{t,i}^{\prime} - 1}F_{x}$

To place each piece m of text T_(t), we will need n_(t) binary variables τ_(t,m,i) which will be equal to 1 if the piece of text is on the i range, and equal to 0 if not.

The constraints for placing each piece of T_(t) shall therefore be:

${\forall{t{\forall{m \in \left\lbrack {1,m_{t}} \right\rbrack}}}} = {{\sum\limits_{i = 1}^{n_{t}}\tau_{t,m,i}} = 1}$

We indicate that the space available is greater than the space required to write out the desired text by:

$\forall{t{\forall{i \in {{\left\lbrack {1,n_{t}} \right\rbrack{\sum\limits_{X = X_{t,i}}^{X_{t,i}^{\prime} - 1}F_{x}}} \geq {\sum\limits_{m = 1}^{m_{t}}{\tau_{t,m,i}\left( {L_{t,m} + {sparespace}} \right)}}}}}}$

Sparespace is a predetermined constant, for example, that is in function of the size of the fonts used.

We also have:

${\sum\limits_{x = 0}^{{XMAXSHEET} - 1}F_{x}} = {{sheet}\mspace{14mu}{length}}$

Depending on the type of text we wish to write out, and depending on the desired placement, other constraints will possibly have to be mentioned.

It is possible that the texts we wish to use are too large for the corresponding wiring diagram. In this case, it is not feasible: the problem cannot be resolved. In this case, the calculation can be taken up from the beginning by reducing the number of vertical lines on each sheet of drawing and by increasing the number of drawing sheets.

Positioning of the Texts on the Cables

The stage in question can be integrated to the fourth operation or, to the contrary, can be produced independently from the production process for the wiring diagram that is described here. We can project two software applications that are entirely distinct: one for producing the wiring diagram and the other for setting the texts into position on the cables.

The elementary objects of the sheet under consideration here are called wires. The totality of all of the wires on a sheet is designated by F and f ∈ F signifies that f is a wire on a given sheet; “nbfil” is the total number of wires on the sheet. We consider that there a sequential order f<f′ between the wires f ∈ F.

Certain wires can belong to structures that are more complex and are called cables. We designate as C the totality of cables on a sheet; nbcable is the total number of cables on the sheet. Each wire can belong to only one cable c and there possibly exist wires that belong to no cable whatsoever.

We differentiate between wires with an increasing x orientation, and wires with returns, which we designate as non-oriented. We use the notation f ∈ o for an oriented wire, and f ∈ no for a wire that is non-oriented.

We have two classes of cable available. The first is comprised of cables where we can fuse type 1 texts, the second covers groups of cables where we can simultaneously fuse type 1 and type 2 texts. We shall respectively note:

c ∈ 1 and c ∈ 2, the cables of class 1 and 2.

The Segments

To each wire is associated a set of segments.

nbseg(f) is the number of segments for wire f.

The segments constitute the spaces reserved for the texts. Each text associated to a wire must appear once and one time only in one of the segments of this wire. Since no text is to be placed on a vertical section of the wire, the segments constitute subintervals that are defined by the horizontal sections of each wire. The coordinates to the segments must be determined based on the results from the fourth operation. The construction is based on the graph for the wire which is described by the list of connections between the nodes for the beginning, the end and for the bend to which are added the nodes for crossing of the wire by other wires. The segments are thus comprised of the consecutive horizontal sections between the graph nodes while respecting the secure distance d to the other various wires.

For a segment s, we introduce the left terminal/s, the right terminal/s and the height altitude/s for which we geometrically identify s as being the straight horizontal line between points (x, y)=(left (s), high (s)) and (x, y)=(right (s), high (s)). We establish that: 0≦left (s)≦right (s)≦L

L being the length of the sheet.

We introduce the maximum terminals for each wire f

${{{left}(f)}:={\min\limits_{s \Subset f}{.\mspace{14mu}{{left}(s)}}}},{{{right}(f)}:={\max\limits_{s \Subset f}{.\mspace{14mu}{{right}(s)}}}}$

For the abscissa x of a text t ∈ f, we must have left (f)≦x≦right (f).

We are assuming that the set of segments s on a wire f is ordered by a relation of s<s′, which can be independent from the order in which the s'es appear on the wire f.

The Segments and Fusing of the Texts on the Cables

The segments s of a wire f belonging to a cable c must be classified according to two categories, depending on whether they permit or do not permit the fusion of the texts 1 (respectively 1 and 2). The segments s that permit fusion of the texts must necessarily be placed between the two sheaths belonging to a corresponding cable c.

We consider that the segments associated to the cables from class 2 that permit the fusion of type1 texts are the same as those which permit the fusion of type 1 and 2 texts.

The Types of Texts

On the wires of the block, we must place the texts, for which we distinguish ten different types. On each wire f, we must place nbtext (f) different texts therefore with nbtext (f)≦10.

By t ∈ f, we shall note the fact that a text of the t, t ∈ {1, . . . , 10} text type is to be placed on the wire f. Based on conventional rules, the numbering order for text types shall follow the preferential order, that is to say: type 1 is the number of the cable, type 2 is the type of gauge and type 3 is the color. For the other types of texts, we shall set in an arbitrary manner, but once and for all, the convention (for types 4, 5 etc. . . . ).

Structure of the Neighborhood Between the Wires

In order to prepare the cost function, we must have a structure available for defining the relation of vicinity between the wires. We can, for example, provide that the wires f and f′, be neighbors, noted by f ⇄ f′, if there exist segments s ⊂ f and s′ ⊂ f′ that are aligned in the following direction:

1) The intervals I:=(left (s), right (s)) and I′:=(left (s′), (right (s′)) have an intersection which is not empty.

2) No wire is to pass between the segments s and s′

3) At least one type of text t belonging to two wires, t ∈ f, t ∈ f′, enters the intersection I and I′

4) high (s)≠high (s′), which prevents us from having a wire be its own neighbor.

It is possible that a wire f has no neighbor, if in the wires f′ that are adjacent to f, the segments aligned according to 1) and 2) do not allow sufficient space for the texts.

Decision Variables

There are two types of decision variables: the real variables and the binary variables. The Latin letters (x and e) designate real variables, and the Greek letters (λ, ω, γ, α) designate binary variables (λ, ω, γ, α ∈ {0, 1}).

Continuous Variables for Localization of Texts

For all wires f and for all types of texts t to be placed on said wire, we are introducing the variable:

x(f, t)=abscissa of the center of text t on the wire f.

Thus, we are therefore led to natural terminals: ∀j ∈ f, ∀t ∈ f, left (j)≦x(f, t)≦right (f).

Binary Variables Belonging to a Segment

For all wires f, and for all types of texts t, and for all segments s and f, we consider the binary variable to be:

λ(f, t, s)=1, if the abscissa of the text t is placed in the segment s of the wire, =0 if not.

The total number of these variables is:

$\sum\limits_{f \in F}{{{nbtext}(f)}.{{nbseg}(f)}.}$

An estimate is provided for this number by:

nbfil. nbtext. nbseg. [nbfil=number of wire/s]

Binary Variables of Arrangement on the Wires

For all wires f and for all pairs of texts t₁<t₂, we introduce the variable of arrangement:

ω(f, t₁, t₂)=1, if the abscissa of the text t₁ is on the left of the text t₂, and =0 if not.

The introduction of the variable ω(f, t₁, t₂) only under the condition that t₁<t₂ allows us reduce the total number of binary variables for the problem of optimization.

Binary Variables Associated to Fusing the Texts on the Cable

For each cable, we introduce a binary variable:

γ(c, 1)=1, if we fuse type 1 texts on the wires of c, =0 if not.

A second binary variable γ(c, 2) shall be added for the cables c from class 2.

γ(c, 2)=1, if we simultaneously fuse texts 1 and 2 on the wires of c, =0 if not.

Binary Variables Associated to the Alignment of the Texts

For all pairs of wires (f, f′) such as f<f′ and such as f and f′ are neighbors, f ⇄ f′, and for all types of texts t entered on the list of the two wires, t ∈ f, t ∈ f′, we introduce a binary variable:

α(f, f′, t)=1, if the text is aligned between the wires f and f′, =0 if not.

Constraints for the Problem of Optimization

Certain constraints are presented and formulated into equations in the following. Other constraints can be considered depending on the rules that are set.

α) Guaranty the Presence of Texts on the Wires

${({C1}){\forall{f \in {F\mspace{11mu}{\forall{t \in {f\mspace{14mu}{\sum\limits_{{s \Subset f},{t \Subset s}}{\lambda\left( {f,t,s} \right)}}}}}}}}} = 1$

Whatever the wire f and whatever the type of text t associated to said wire, t ∈ f, the text must be positioned once and only once on one of the segments s of said wire f, for which it is known, a priori, that this text will enter.

β) Positioning of the Texts on a Segment

A second class (C2) of constraints has the form:

∀f ∈ F, ∀t ∈ f, ∀s ∈ f  such  that  t ⋐ s ${{{{left}(f)}\left( {1 - {\lambda\left( {f,t,s,} \right)}} \right)} + {{{left}(s)}{\lambda\left( {f,t,s} \right)}}} \leq {{x\left( {f,t} \right)} - {\frac{{long}(t)}{2}.{x\left( {f,t} \right)}} + \frac{{long}(t)}{2}} \leq {{{{right}(f)}\left( {1 - {\lambda\left( {f,t,s} \right)}} \right)} + {{{right}(s)}{{\lambda\left( {f,t,s} \right)}.}}}$

The first of these two constraints signifies that if the text t of the wire f is situated in the segment s of said wire, the left side of the text t, (that is to say, x (f, t)−long (t)/2) must be to the right of the left side, (that is to say left (s)), of the segment itself, so that if t were not in this segment, the left side of the text would at least be to the right of the left side, (that is to say, left (f)) of the entire wire.

The second constraint expresses the same thing for the right sides of the segment and of the text.

γ) Relative Placement Between Different Texts of the Same Wire

For the relative placement of texts for a wire, we consider the constraints (C3):

∀f ∈ F, ∀s ⋐ f, ∀t, t^(′) ∈ f, such  that  t < t^(′)and  t ⋐ s, t^(′) ⋐ s(Do  not  enter  this  constraint  if  f ∈ C, C ∈ 2, t = 1  and  t^(′) = 2) ${{\omega\left( {f,t,t^{\prime}} \right)}{\lambda\left( {f,t,s} \right)}{{\lambda\left( {f,t^{\prime},s} \right)}\left\lbrack {{x\left( {f,t} \right)} + \frac{{long}(t)}{2} + d - {x\left( {f,t^{\prime}} \right)} + \frac{{long}\left( t^{\prime} \right)}{2}} \right\rbrack}} \leq 0$ ${\left( {1 - {\omega\left( {f,t,t^{\prime}} \right)}} \right){\lambda\left( {f,t,s} \right)}{{\lambda\left( {f,t^{\prime},s} \right)}\left\lbrack {{x\left( {f,t^{\prime}} \right)} + \frac{{long}\left( t^{\prime} \right)}{2} + d - {x\left( {f,t} \right)} + \frac{{long}(t)}{2}} \right\rbrack}} \leq 0$

The first of these two constraints states that if the texts t and t′ are in the same segment s of the wire f, and if t must be placed in front of t′, then the right side of t must be to the left of the left side of the text t′, all the while maintaining a secure distance d.

The constraint (C3) must be removed when c is a class 2 cable, f ∈ c, and t, t′ ∈ f are text 1 and text 2 types. In this case, we tend to fuse these two texts, and the constraint (C3) becomes contradictory. In this particular case, the constraint (C3) shall be replaced by a conditional constraint.

When introduced, the constraints (C3) are non-linear. We therefore subsequently use a device to render them linear. This device can be described as follows:

Let us assume binary variables β₁, . . . , β_(r), x a real variable (or discrete variable) with a known upper terminal, x≦c. We then have the equivalence of:

$\begin{matrix} {{{{\left. 1 \right)\mspace{14mu} x} \leq {c_{2}\mspace{14mu}{on}\mspace{14mu}{condition}\mspace{14mu}{that}\mspace{14mu}\beta_{1}}} = 1},\ldots\mspace{11mu},{B_{r} = 1}} \\ {{\left. 2 \right)\mspace{14mu}\beta_{1}\mspace{11mu}\ldots\mspace{11mu}{B_{r}\left( {x - c_{2}} \right)}} \leq 0} \\ {{\left. 3 \right)\mspace{14mu}\left( {x - c_{2}} \right)} \leq {\left( {r - {\sum\limits_{i = 1}^{r}{\beta\; i}}} \right)\mspace{14mu}{{c_{1} - c_{2}}}}} \end{matrix}$

With this device, which we will use again further below, the constraints (C3) are translated by:

$\left. {{{\forall f},{\forall{s \Subset f}},{\forall t},{{{t^{\prime\mspace{14mu}}{such}\mspace{14mu}{that}\mspace{14mu} t} < {t^{\prime}\mspace{14mu}{and}\mspace{14mu} t}} \Subset s},{t^{\prime} \Subset s},\left( {{{{Do}\mspace{14mu}{not}\mspace{14mu}{enter}\mspace{14mu}{this}\mspace{14mu}{constraint}\mspace{14mu}{if}\mspace{14mu} f} \in c},{C \in 2},{t = {{1\mspace{14mu}{and}\mspace{14mu} t^{\prime}} = 2}}} \right)}{{\left( {{x\left( {f,t} \right)} + \frac{{long}(t)}{2}} \right) + d - \left( {{x\left( {f,t^{\prime}} \right)} - \frac{{long}\left( t^{\prime} \right)}{2}} \right)} \leq {L\left( {3 - {\omega\left( {f,t,t^{\prime}} \right)} - {\lambda\left( {f,t,s} \right)} - {\lambda\left( {f,t^{\prime},s} \right)}} \right)}}{{\left( {{x\left( {f,t^{\prime}} \right)} + \frac{{long}\left( t^{\prime} \right)}{2}} \right) + d - \left( {{x\left( {f,t} \right)} - \frac{{long}(t)}{2}} \right)} \leq {{L\left( {2 + {\omega\left( {f,t,t^{\prime}} \right)}} \right)} - {\lambda\left( {f,t,s} \right)} - {\lambda\left( {f,t^{\prime},s} \right)}}}} \right)$

δ) Alignment of the Texts

Text alignment is managed by the α(f, f′, t) variables. These variables come with the following constraints (C4): ∀f,f′ ∈ F f<f′ f ⇄ f′ α(f,f′,t)(x(f,t)−x(f,t))=0

If t is aligned between f and f′, then the abscissas must be the same in the two wires.

The linear form is established for (C4) ∀f,f′ ∈ F f<f′ f ⇄ f′ x(f,t)−x(f′,t)≦L(1−α(f,f′,t)) x(f′,t)−x(f,t)≦L(1−α(f,f′,t))

Cost Function

As further above, in function of the constraints described here above, we determine the cost function which we optimize to obtain the placement of the texts.

Just as for the preceding four operations, the indicated variables and constraints are provided as exemplary embodiments to show how the equations can be established in a procedure in accordance with the invention. Other variables can be taken under consideration as well as other corresponding constraints. It is equally possible that some of the variables and constraints mentioned here prove to be useless for specific cases of embodiment.

Routes and Stitchings

Here, we are dealing with an application specific to the domain of aeronautics. The routes are presented in the form of arrows starting from a cable and to which texts are associated that provide information on this cable.

In a manner similar to that for the placement of texts, we are dealing with an application which, as shown in the following, can be integrated to the production process of a wiring diagram in accordance with the present invention, but this application can also be entirely dissociated from said process.

Introduction

The placement of the routes comes last. There is an astronomical number of possible routes. It is imperative to reduce the number of possibilities to a minimum. The stitchings of wires are advantageously treated at the same time as the routes.

Determination of Candidate Routes

A possible route is a vector comprised of six values <r, x, y₁, y₂, d, o>

r is the route identifier.

x is the vertical line on which the route is located.

y₁ is the altitude of the text for the route (and of the start of the arrow).

y₂ is the altitude of the end of the arrow for the route.

d is the direction of the arrow (up/down).

o is the side on which the text for the arrow is located (left/right).

A possible stitching is a vector comprised of five values <r, x, y₁, y₂, d>

r is the identifier for the stitching.

x is the vertical line on which the stitching is located.

y₁ is the altitude of the arrow's starting point.

The second line of stitching is below if the arrow is directed upward, and in the converse case, it is on top.

y₂ is the altitude of the end of the arrow for the stitching.

d is the direction of the arrow (up/down).

The stitching text is always centered on the arrow.

Preliminary Calculations

First of all, a matrix M corresponding to the diagram is calculated (an element by grid point) with:

M_(x,y)=AVAILABLE: point available for a text or for a routing or stitching arrow.

M_(x,y)=<r, f>: cable without text (wire f, route r). The point that is available to be vertically traversed by an arrow (note: includes the virtual points of passage).

M_(x,y)=UNAVAILABLE: point is not usable (inside of a component, of a text, of a vertical line, etc. . . . ).

Generation of Possible Routes

The determination of the routes is carried out, for example, route by route and vertical line by vertical line. The processing step for the most frequently used route is omitted because it will be the default route for the wiring diagram.

Analysis of the Vertical Lines

For each route R and for each vertical line X, we analyze the points of the vertical line, L_(R) being the length of the route, in the following manner:

1) The points where the text for the route can possibly be placed: ∀x∈[X−L_(R), X], M_(x′y)=AVAILABLE for a placement on the left or ∀x∈[X, X+L _(R′)], M_(x′y)=AVAILABLE for a placement on the right.

2) The AVAILABLE points that do not fulfill the conditions above: the text for the route cannot be placed here, but these points may be used for the route's arrow.

3) The UNAVAILABLE points. One is not permitted to place anything here and these are blocking points.

4) The points through which a cable having the route R passes (i.e., Mx, y=<R, *>.

5) The points through which a cable having a route other than R passes (i.e. Mx,_(y)=<R′, *>,R′≠R).

Route Selection

The selection of the routes is done immediately after the analysis of the vertical lines and is also located inside of the double loop of the routes/vertical lines.

Being that the UNAVAILABLE points are absolute stopping points, we deal separately with the blocks of points situated between two such consecutive points and containing at least one cable of the route underway. We then regroup the consecutive black points into subgroups (it is the natural factorization of the contiguous cables having the same route).

Ascending candidate routes (direction=up): a route may only start from an AVAILABLE point and may not meet with another AVAILABLE point before having reached the first subgroup of the cables having the proper route. In fact, there are very few good reasons for distancing, to no purpose, a route from the cables to which it is associated.

One can draw up the parameters for the number of encounterable points AVAILABLE before the first subgroup. The above approach affects the value of 0 in this parameter, but it suppresses the options and in the extreme situation, it can render the problem infeasible for specific twisted cases.

For each starting point y fulfilling the above condition, we consider the subgroups of the cables g₁=<ymin₁, ymax₁>, . . . ; g_(n)=<ymin_(n), ymax_(n)> located after y and we generate a route for each possible cumulative factorization: (y, g1), (y, g1, g2), . . . , (y, g1, g2), . . . , (y, g1, g2, . . . g_(n)). The k^(nth) route will therefore have the parameters <R, X, y, ymax_(k), up, o>, o being L (left) or R (right), depending on the case.

In a similar manner, we generate descending routes (direction=down) by traveling the vertical line in the inverse direction.

For each potential route generated in this manner, we create a binary variable IRS (R, X, y, y′, d, o) which shall be equal to 1, if the route shall come to really exist and equal to 0 if not.

We calculate W (R, X, y, y′, d, o) the number of points through which no cable passes that has the R route within the route (i.e. the number of points wasted) and T (R, X, y, y′, d, o) the number of cables traversed and not having the R route.

The routes <R, X, y, y′, d, o> having:

${W\left( {R,X,y,y^{\prime},d,o} \right)} \geq {{\min\limits_{X,y,y^{\prime},d,o}{W\left( {R,X,y,y^{\prime},d,o} \right)}} + W_{o}}$

as well as the route having:

${T\left( {R,X,y,y^{\prime},d,o} \right)} \geq {{\min\limits_{X,y,y^{\prime},d,o}{T\left( {R,X,y,y^{\prime},d,o} \right)}} + t_{o}}$

with for example W_(o)=8 and t_(o)=3

are, for example, ignored.

Let us assume F_(f), a set of routes. <R, X, y, y′, d, o> is included in all the Ff such that the route f is R and at least one of the cables from one of the subgroups of <R, X, y, y′, d, o> is f. F_(f) shall be the list of the possible routes containing the wire f.

Let us assume G_(u, z) a set of routes. <R, X, y, y′, d, o> is included in all of the G_(x, z) such as z ∈ [y, y′] and in all of the G_(u, y) such as u ∈ [X−L_(R), X] for the routes on the left or u ∈ [X, X+L_(R)] for the routes on the right. G_(u, z) shall therefore contain all of the possible routes using the grid point (u, z).

Generation and Selection of the Possible Stitchings

Quite similar to the routes, except that the AVAILABLE points are of the following type:

${\forall{X \in {\left\lbrack {{X - \frac{L_{p}}{2}},{X + \frac{L_{p}}{2}}} \right\rbrack M_{x,y}}}} = {AVAILABLE}$

and that the starting point of a stitching must have two consecutive AVAILABLE points.

For each potential route generated in this manner, we create a binary variable ISP (P, X, y, y′, d) which shall be equal to 1, if the stitching shall come to really exist and equal to 0 if not.

The y designates the altitude of the internal line of the text for the stitching. We calculate WP (P, X, y, y′, d) the number of points wasted and TP (P, X, y, y′, d) the number of cables traversed and not being the one on which the stitching P_(o) bears.

Just as previously, the stitchings <P, X, y, y′, d> having:

WP(P, X, y, y′, d)≧3

as well as the stitchings having:

TP (P, X, y, y′, d)≧2

are, for example, ignored.

We also create sets of stitchings GP_(u, z) and we include <P, X, y, y′, d> in all of the GP_(X, z) such as:

z ∈ [y+1, y′], if d=DOWN or z ∈ [y−1, y′], if d=UP

and in all of the G_(u, y) such as u ∈ [X−L_(p)/2, X+L_(p)/2],

and if d=DOWN in all of the G_(u, y+1) such as u ∈ [X−L_(p)/2, X+L_(p)/2],

and if d=UP in all of the G_(u, y−1) such as u ∈ [X−L_(p)/2, X+L_(p)/2],

GP_(u, z) shall therefore contain all of the possible stitchings using the grid point (u, z).

Constraints

Each and every wire must take its route at least one time:

$\forall{{f{\sum\limits_{{< R},X,y,y^{\prime},d,{{o >} \in F_{f}}}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}}} \geq 1}$

and preferably not more than three times:

$\forall{{f{\sum\limits_{{< R},X,y,y^{\prime},d,{{o >} \in F_{f}}}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}}} \leq 3}$

Each and every stitching must be present one time:

${\forall{P{\sum\limits_{{< X},y,y^{\prime},{d >}}{{ISP}\left( {P,X,y,y^{\prime},d} \right)}}}} = 1$

The stitchings and the routes must not intersect:

∀u, z  such  that  G_(u, z) + GP_(u, z) ≥ 2 ${{\sum\limits_{{< R},X,y,y^{\prime},d,{{o >} \in G_{u,z}}}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}} + {\sum\limits_{{< P},X,y,y^{\prime},{{d >} \in {GP}_{u,z}}}{{ISP}\left( {P,X,y,y^{\prime},d} \right)}}} \leq 1$

Optimization

Number of routes:

${NROUTE} = {\sum\limits_{{< R},X,y,y^{\prime},d,{o >}}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}}$

Number of cables traversed by the routes:

$\mspace{20mu}{{NTRAV}_{r} = {\underset{{T{({R,X,y,y^{\prime},d,o})}} \neq 0}{\sum\limits_{{< R},X,y,y^{\prime},d,{o >}}}{{T\left( {R,X,y,y^{\prime},d,o} \right)}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}}}}$

Number of cables traversed by the stitchings:

${NTRAV}_{p} = {\underset{{{TP}{({P,X,y,y^{\prime},d})}} \neq 0}{\sum\limits_{{< P},X,y,y^{\prime},{d >}}}{{{TP}\left( {P,X,y,y^{\prime},d} \right)}{{ISP}\left( {P,X,y,y^{\prime},d} \right)}}}$

Wasted length:

${LG} = {{\underset{{W{({R,X,y,y^{\prime},d,o})}} \neq 0}{\sum\limits_{{< R},X,y,y^{\prime},d,{o >}}}{{W\left( {R,X,y,y^{\prime},d,o} \right)}{{ISR}\left( {R,X,y,y^{\prime},d,o} \right)}}} + {\underset{{{WP}{({P,X,y,y^{\prime},d})}} \neq 0}{\sum\limits_{{< P},X,y,y^{\prime},{d >}}}{{{WP}\left( {P,X,y,y^{\prime},d} \right)}{{ISP}\left( {P,X,y,y^{\prime},d} \right)}}}}$

we minimize: C_(r)NROUTE+C_(tr)NTRAV_(r)+C_(tp)pNTRAV_(p)+C_(g)LG

with for example: C_(r)=4, C_(tr)=5, C_(tp)=2, and C_(g)=2

Resolution

The above description indicates to the person skilled in the art how to formulate into an equation the technical problem which is set before him so as to resolve the problem with a computer while using techniques that are known for the resolution of equation systems and optimization systems. Several resolution techniques may be applied to linear equation systems such as those defined further above. We cite, for example, the “branch and bound” techniques (or in French, the so-called techniques of separation and evaluation) or the “branch and cut” technique (or in French, the so-called separation and cutting technique).

The solutions emerging from the resolution of said systems of equations are then forwarded to a translator which interprets the data it receives in order to then convert them into information which permits the production of a diagram. This information is then sent to a “terminal”, for example to a monitor screen or to a printer, so that the user may visualize the diagram corresponding to the data which were introduced at the beginning.

The use of linear equations and the manner of resolving them in several operations allows for the resolution of technical problems which arise during the production of a wiring diagram that is done automatically. In fact, a computer could not solve in one single operation, not even for cable routes of “reasonable” size, all of the equations describing the constraints so as to produce the wiring diagram. 

What is claimed as new and desired to be secured by Letters Patent of the United States is:
 1. A process for generating a wiring diagram showing boxes, each representing a component used in a device subject to cabling, connecting lines, each representing a connection between two components, and terminals corresponding to a possible connection point between a connecting line and a box, said boxes being arranged along an axis of abscissas and an axis of ordinates, the process comprising the following steps: inputting the components to be represented on said wiring diagram, each component being associated with constraints that were previously translated in linear equations, inputting the connections to be represented on said wiring diagram, generating a first system of equations, solving said first system of equations, optimizing, based on said solving of said first system, a relative positioning of the boxes on the axis of abscissas and an orientation of said boxes, generating a second system of equations, solving said second system of equations, optimizing, based on said solving of said second system, a relative placement of the boxes relative to the axis of ordinates and a relative positioning of the terminals of each box relative to said axis of ordinates, generating a third system of equations, solving said third system of equations, placing, in an absolute manner, based on said solving of said third system, the boxes relative to the axes of abscissas and ordinates, and optimizing, based on said solving of said third system, a routing of the connections.
 2. A process in accordance with claim 1, wherein the connections to be represented are cables comprised of one or several wires, wherein a sheath is associated to a cable comprised of several wires, and wherein, during the relative positioning of the boxes on the axis of abscissas, the sheaths of the cables are relatively positioned in terms of the boxes to which they are connected.
 3. A process in accordance with claim 1, wherein said third system of equations comprises two sub-systems, and said method comprises the steps of solving said two sub-systems of equations and of placing based on said solving of one of said sub-systems, in an absolute manner, the boxes in terms of the axis of ordinates, and placing, based on said solving of another of said sub-systems, in an absolute manner, the boxes in terms of the axis of abscissas and optimizing the routing of the connections based on said solving of said another of said sub-systems.
 4. A process in accordance with claim 1, wherein said step of optimizing said routing of the connections comprises verifying the presence of a location on the connections configured to receive a text.
 5. A process in accordance with claim 4, further comprising, after verifying the presence of a location for the text, a step of determining a positioning of the text on the connections by solving a system of equations.
 6. A process in accordance with claim 1, wherein the linear equations exclusively use whole numbers.
 7. A process in accordance with claim 1, further comprising the steps of defining at least one of said boxes by its size and its terminals and of associating said box with a graphic symbol and/or a text and/or a cable symbol associated to one or several terminals.
 8. A process in accordance with claim 1, wherein said boxes indicate whether their width is variable, whether their height is variable, whether a sequential order of their terminals is modifiable, and whether the boxes are equipped with outlets.
 9. A process in accordance with claim 1, wherein for the first system of equations, said boxes are assumed to be arranged on a predetermined number of vertical lines, and said first system of equations includes equations that translate constraints on the positioning of the boxes on said vertical lines.
 10. A process in accordance with claim 1, wherein the first system of equations includes equations that evaluate a number of bends produced by the connecting lines linking the boxes and wherein said number is minimized.
 11. A process in accordance with claim 1, wherein the second system of equations includes equations that translate constraints associated to grouping the terminals inside of the boxes.
 12. A process in accordance with claim 1, wherein the second system of equations includes equations that evaluate a number of intersections produced between the connecting lines linking the boxes and wherein said number is minimized.
 13. A process in accordance with claim 1, wherein said step of placing the boxes, in said absolute manner, along the axis of ordinates, comprises arranging the terminals of the boxes at altitudes which are all multiples of a predetermined grid pitch.
 14. A process in accordance with claim 1, wherein said step of placing the boxes, in said absolute manner, along the axis of ordinates, comprises solving equations that evaluate a number of disconnects for the connecting lines, and minimizing said number of disconnects.
 15. A process in accordance with claim 1, wherein said step of placing the boxes, in said absolute manner, along the axis of abscissas, comprises evaluating a number of overlaps in the connecting lines in a horizontal direction and in a vertical direction and minimizing said number of overlaps.
 16. A process in accordance with claim 1, wherein said step of placing the boxes, in said absolute manner, along the axis of abscissas, comprises evaluating a number of intersections of the connections and minimizing said number of intersections.
 17. A process in accordance claim 1, further comprising, for establishing the equations for the first, second and third systems of equations, defining real variables corresponding to a localization, and to a dimension, and defining binary variables that either assume a value of 0, or a value of 1, to indicate an element belonging to a set, to indicate the relative positioning of two elements, and wherein, the equations translate constraints proper to a type of wiring diagram produced.
 18. A process in accordance with claim 1, further comprising introducing solutions originating from said solving steps into a translator to produce a diagram based on numerical data, and to produce said wiring diagram corresponding to numerical data obtained from said steps of solving said first, second and third systems of equations.
 19. A computer program stored on an information storage medium, said computer program comprising instructions for performing a process in accordance with claim 1, when said program is loaded with and executed by an information system.
 20. An information system, configured to perform a process in accordance with claim
 1. 21. A data medium that is readable by an information system, said data medium comprising instructions from a computer program for performing a process in accordance with claim 1 when said computer program is loaded with and executed by an information system.
 22. A process in accordance with claim 1, further comprising the step of printing said wiring diagram on a sheet of paper.
 23. A process in accordance with claim 1, further comprising the step of displaying said wiring diagram on a screen.
 24. A process in accordance with claim 1, wherein said device subject to cabling is an aircraft and said boxes represent aircraft electrical components. 